Remarks on Distance-Balanced Graphs
نویسندگان
چکیده مقاله:
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
منابع مشابه
remarks on distance-balanced graphs
distance-balanced graphs are introduced as graphs in which every edge uv has the followingproperty: the number of vertices closer to u than to v is equal to the number of vertices closerto v than to u. basic properties of these graphs are obtained. in this paper, we study theconditions under which some graph operations produce a distance-balanced graph.
متن کاملOn distance-balanced graphs
It is shown that the graphs for which the Szeged index equals ‖G‖·|G| 2 4 are precisely connected, bipartite, distance-balanced graphs. This enables to disprove a conjecture proposed in [Some new results on distance-based graph invariants, European J. Combin. 30 (2009) 1149–1163]. Infinite families of counterexamples are based on the Handa graph, the Folkman graph, and the Cartesian product of ...
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملnote on edge distance-balanced graphs
edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.
متن کاملDistance-balanced graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. The new concept is connected with symmetry conditions in graphs and local operations on graphs are studied with respect to it. Distance-balanced C...
متن کاملn-EDGE-DISTANCE-BALANCED GRAPHS
Throughout this paper, we present a new class of graphs so-called n-edgedistance-balanced graphs inspired by the concept of edge-distance-balanced property initially introduced by Tavakoli et al. [Tavakoli M., Yousefi-Azari H., Ashrafi A.R., Note on edge distance-balanced graphs, Trans. Combin. 1 (1) (2012), 1-6]. Moreover, we propose some characteristic results to recognize 2-edge-distance-bal...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 2 شماره 2
صفحات 67- 71
تاریخ انتشار 2011-12-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023